Algebras Defined from Ordered Sets and the Varieties they Generate
نویسندگان
چکیده
We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by these algebras. In particular we consider two different but related methods for constructing an algebra with one binary operation from an arbitrary ordered set with a top element. The two varieties generated by all these algebras are shown to be well-behaved in that they are locally finite, finitely based, and have an equationally definable order relation. We exhibit a bijection between the subdirectly irreducible algebras in each variety and the class of all ordered sets with top element. We determine the structure and cardinality of the free algebra on n free generators and provide sharp bounds on the number of n-generated algebras in each variety. These enumeration results involve the number of quasi-orders on an n-element set.
منابع مشابه
Factor varieties
The universal algebraic literature is rife with generalisations of discriminator varieties, whereby several investigators have tried to preserve in more general settings as much as possible of their structure theory. Here, we modify the definition of discriminator algebra by having the switching function project onto its third coordinate in case the ordered pair of its first two coordinates bel...
متن کاملEntropic Hopf algebras
The concept of a Hopf algebra originated in topology. Classically, Hopf algebras are defined on the basis of unital modules over commutative, unital rings. The intention of the present work is to study Hopf algebra formalism (§1.2) from a universal-algebraic point of view, within the context of entropic varieties. In an entropic variety, the operations of each algebra are homomorphisms, and ten...
متن کاملPOWERSET OPERATOR FOUNDATIONS FOR CATALG FUZZY SET THEORIES
The paper sets forth in detail categorically-algebraic or catalg foundations for the operations of taking the image and preimage of (fuzzy) sets called forward and backward powerset operators. Motivated by an open question of S. E. Rodabaugh, we construct a monad on the category of sets, the algebras of which generate the fixed-basis forward powerset operator of L. A. Zadeh. On the next step, w...
متن کاملRegular tree languages and quasi orders
Regular languages were characterized as sets closed with respect to monotone well-quasi orders. A similar result is proved here for tree languages. Moreover, families of quasi orders that correspond to positive varieties of tree languages and varieties of finite ordered algebras are characterized.
متن کاملAuthor: Saeed Salehi (Saeed @ Math.Net) Title: Varieties of Tree Languages
Trees are among the most fundamental and ubiquitous structures in mathematics. Tree languages and automata on trees have been studied extensively since the 1960s from both a purely mathematical and application point of view. When trees are defined as terms, universal algebra becomes directly applicable to tree automata and, on the other hand, the theory of tree automata suggests new notions and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 23 شماره
صفحات -
تاریخ انتشار 2006